TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION
    21.
    发明申请
    TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION 有权
    精确的CARDINALITY QUERY优化技术

    公开(公告)号:US20100235347A1

    公开(公告)日:2010-09-16

    申请号:US12404284

    申请日:2009-03-14

    CPC classification number: G06F17/30463

    Abstract: An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan.

    Abstract translation: 一种精确的基数查询优化系统和方法,用于优化具有多个表达式的查询,以获得查询的基数最优查询执行计划。 系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间,当所有基数是精确的时,其包含查询执行计划。 该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术,限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是 以及表达式排序技术,其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

    Techniques for estimating progress of database queries
    24.
    发明申请
    Techniques for estimating progress of database queries 有权
    估计数据库查询进度的技术

    公开(公告)号:US20060282404A1

    公开(公告)日:2006-12-14

    申请号:US11149968

    申请日:2005-06-10

    Abstract: Techniques for estimating the progress of database queries are described herein. In a first implementation, a respective lower-bound parameter is associated with each node in an operator tree that representing a given database query, and the progress of the database query at a given point is estimated based upon the lower-bound parameters. In a second implementation, the progress of the query is estimated by associating respective lower-bound and upper-bound parameters with each node in the operator tree. The progress of the query at the given point is then estimated based on the lower-bound and upper-bound parameters. The progress estimate is computed by dividing the work done so far by the sums of the above averages for each node in the tree.

    Abstract translation: 本文描述了用于估计数据库查询的进度的技术。 在第一实现中,相应的下限参数与表示给定数据库查询的运算符树中的每个节点相关联,并且基于下限参数来估计给定点处的数据库查询的进度。 在第二个实现中,通过将相应的下限和上限参数与运算符树中的每个节点相关联来估计查询的进度。 然后,基于下限和上限参数估计给定点处的查询进度。 进度估计是通过将迄今为止完成的工作除以树中每个节点的上述平均值的总和来计算的。

    Framework for testing query transformation rules
    25.
    发明授权
    Framework for testing query transformation rules 有权
    查询转换规则的框架

    公开(公告)号:US08630998B2

    公开(公告)日:2014-01-14

    申请号:US12789486

    申请日:2010-05-28

    CPC classification number: G06F17/30448 G06F11/3664 G06F11/3676

    Abstract: Described is a test framework for testing transformation rules of query optimizers. Rule patterns obtained as tree structures from a query optimizer are used to generate queries that are used to test the rule optimizer's transformation rules. The test framework tracks which rules are exercised for each query, and also determines the correctness of the transformation rule by comparing the results of the query processing with the rule and without the rule (by turning off the rule). The test framework creates a composite pattern corresponding to two or more rules, such as to test rules in a set (e.g., as pairs). Also described is the efficient execution of a test suite for correctness testing, in which queries of the test suite are selected based upon cost information.

    Abstract translation: 描述了用于测试查询优化器的转换规则的测试框架。 使用从查询优化器获取的树结构的规则模式用于生成用于测试规则优化器转换规则的查询。 测试框架跟踪每个查询执行哪些规则,并且通过将查询处理的结果与规则进行比较,并且通过将规则(通过关闭规则)进行比较来确定变换规则的正确性。 测试框架创建一个对应于两个或多个规则的复合模式,例如测试集合中的规则(例如,成对)。 还描述了用于正确性测试的测试套件的有效执行,其中基于成本信息来选择测试套件的查询。

    EFFICIENT FINE-GRAINED AUDITING FOR COMPLEX DATABASE QUERIES
    26.
    发明申请
    EFFICIENT FINE-GRAINED AUDITING FOR COMPLEX DATABASE QUERIES 审中-公开
    复杂数据库查询的高效细粒度检查

    公开(公告)号:US20130132352A1

    公开(公告)日:2013-05-23

    申请号:US13303154

    申请日:2011-11-23

    CPC classification number: G06F16/2453 G06F16/211

    Abstract: The present application provides for techniques for implementing data auditing embodiments that determine whether a query into a database is or has referenced forbidden data within the database. Various techniques are given for efficiently finding all tuples in a database referenced by a given query. A set of sensitive data is determined within a database and the set of sensitive data is employed to define a forbidden view within the database. Data within the database may be annotated to provide efficient identification of data access by query. Incoming queries may be analyzed and modified to propagate annotations for analyzing what data is or was accessed.

    Abstract translation: 本申请提供了用于实现数据审计实施例的技术,其确定数据库中的查询是否是数据库内的或已经引用了数据库中的禁止数据。 给出了各种技术,用于有效地查找给定查询引用的数据库中的所有元组。 在数据库中确定一组敏感数据,并采用敏感数据集来定义数据库中的禁止视图。 可以注释数据库内的数据,以便通过查询提供对数据访问的有效识别。 可以分析和修改传入查询以传播用于分析数据被访问或被访问的注释。

    AUDITING QUERIES USING QUERY DIFFERENTIALS
    27.
    发明申请
    AUDITING QUERIES USING QUERY DIFFERENTIALS 有权
    使用查询差异审核查询

    公开(公告)号:US20120150841A1

    公开(公告)日:2012-06-14

    申请号:US12963506

    申请日:2010-12-08

    CPC classification number: G06F17/30289

    Abstract: Methods and systems for auditing queries using query differentials are disclosed. A method includes identifying a set of queries, determining if results of each query of the set of queries are different from results of respective differentials of each query of the set of queries, and based on the determining, making a characterization of each query of the set of queries as one of safe and unsafe. Access is provided to the characterization of each query of the set of queries.

    Abstract translation: 公开了使用查询差异来审计查询的方法和系统。 一种方法包括识别一组查询,确定该组查询的每个查询的结果是否与该组查询的每个查询的相应差异的结果不同,并且基于确定,对每个查询的每个查询进行表征 一组查询作为安全和不安全的一个。 访问被提供给查询集合的每个查询的表征。

    Techniques for exact cardinality query optimization
    28.
    发明授权
    Techniques for exact cardinality query optimization 有权
    精确基数查询优化技术

    公开(公告)号:US08185519B2

    公开(公告)日:2012-05-22

    申请号:US12404284

    申请日:2009-03-14

    CPC classification number: G06F17/30463

    Abstract: An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan.

    Abstract translation: 一种精确的基数查询优化系统和方法,用于优化具有多个表达式的查询,以获得查询的基本优化查询执行计划。 系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间,当所有基数是精确的时,其包含查询执行计划。 该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术,限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是 以及表达式排序技术,其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

    Turbocharger protection systems and methods
    29.
    发明授权
    Turbocharger protection systems and methods 有权
    涡轮增压器保护系统及方法

    公开(公告)号:US07987672B2

    公开(公告)日:2011-08-02

    申请号:US12043211

    申请日:2008-03-06

    Abstract: A turbocharger protection system for an engine system that includes a particulate filter and a turbocharger comprises a delta pressure estimator that estimates a pressure difference in a particulate filter. A pressure factor estimator module estimates a pressure factor based on the difference and barometric pressure. A fuel limit estimator module protects the turbocharger by selectively limiting fuel injection to the engine based on the pressure factor.

    Abstract translation: 一种用于包括微粒过滤器和涡轮增压器的发动机系统的涡轮增压器保护系统包括估计微粒过滤器中的压力差的δ压力估计器。 压力因子估计器模块基于差异和大气压力估计压力因子。 燃料极限估计器模块通过基于压力因子选择性地限制对发动机的燃料喷射来保护涡轮增压器。

    Fine-grained access control in a database by preventing information leakage and removing redundancy
    30.
    发明授权
    Fine-grained access control in a database by preventing information leakage and removing redundancy 失效
    通过防止信息泄漏和消除冗余,在数据库中进行细粒度的访问控制

    公开(公告)号:US07685194B2

    公开(公告)日:2010-03-23

    申请号:US11468928

    申请日:2006-08-31

    CPC classification number: G06F17/30471 G06F17/30306 G06F21/6227

    Abstract: Fine-grained access control for querying a database with low overhead and safety plans. In a view placement approach, base relations of the query expression are replaced by views that are appropriate for the particular user. Information leakage via UDF pushing, exception processing, and error messages can be prevented by generating safe plans. An existing query optimizer can be modified to perform redundancy removal and safe plan implementation. Subsumption testing available in materialized view matching can be exploited by the query optimizer. Authorization inference is exploited to generate safe plans.

    Abstract translation: 用于以低开销和安全计划查询数据库的细粒度访问控制。 在视图放置方法中,查询表达式的基础关系被替换为适合特定用户的视图。 可以通过生成安全计划来防止通过UDF推送,异常处理和错误消息的信息泄漏。 可以修改现有的查询优化器,以执行冗余删除和安全计划实施。 查询优化器可以利用实体​​化视图匹配中的可用度量测试。 利用授权推理来制定安全计划。

Patent Agency Ranking