会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Software modification by group to minimize breakage
    • 按组进行软件修改,尽量减少破损
    • US08352930B1
    • 2013-01-08
    • US11379953
    • 2006-04-24
    • E. John SebesJay Vaishnav
    • E. John SebesJay Vaishnav
    • G06F9/44G06F9/445G06F17/28
    • G06F8/65
    • A method is employed to group computers to facilitate application of a software modification to the computers. The method includes identifying a global set of computers to which it is desired to apply the software modification. Based on characteristics of software configurations of the computers of the identified global set, the computers of the identified global set are grouped into a plurality of clusters. Grouping the computers into a plurality of clusters includes processing syntactic information about the computers to identify the plurality of clusters and applying the software modification to the computers of the clusters. The software modification is applied with an adjustment for each cluster in an attempt to avoid software breakage of the computers of that cluster.
    • 采用一种方法来分组计算机以便于对计算机应用软件修改。 该方法包括识别期望应用软件修改的全局计算机集合。 基于所识别的全局集合的计算机的软件配置的特征,所识别的全局集合的计算机被分组成多个集群。 将计算机分组成多个群集包括处理关于计算机的句法信息以识别多个群集并将该软件修改应用于群集的计算机。 软件修改应用于每个集群的调整,以避免软件破坏该集群的计算机。
    • 8. 发明授权
    • System and method for optimizing database queries
    • 优化数据库查询的系统和方法
    • US5822747A
    • 1998-10-13
    • US702106
    • 1996-08-23
    • Goetz GraefePedro CelisJay VaishnavHansjorg Zeller
    • Goetz GraefePedro CelisJay VaishnavHansjorg Zeller
    • G06F17/30
    • G06F17/30463Y10S707/99932Y10S707/99934
    • A system and method for optimizing a database query is herein disclosed. The system consists of a search engine and a database implementor that determines an optimal plan for executing a SQL query. The SQL query is represented as a query tree consisting of a number of nested expressions. The search engine generates a number of plans from which an optimal plan is selected. Plans are generated through the application of a set of rules consisting of implementation and transformation rules. Implementation rules are used to obtain plans. Transformation rules are used to determine equivalent expressions. A plan for the query tree entails finding plans for each expression within the tree where each plan is generated in accordance with a prescribed set of rules. The database implementor selects the set of rules such that more promising plans are generated rather than generating all possible plans. In a preferred embodiment of the invention, multiple passes are made by the search engine in order to determine the optimal plan. In a first pass, implementation rules are used in order to generate a first plan having a cost that is used as a threshold when generating for additional plans. In each subsequent pass, a set of implementation and transformation rules is used to generate one or more plans whose cost does not exceed the threshold. An optimal plan is selected from the generated plans as the one having the lowest cost.
    • 本文公开了一种用于优化数据库查询的系统和方法。 该系统由搜索引擎和数据库实现者组成,它确定执行SQL查询的最佳方案。 SQL查询表示为由许多嵌套表达式组成的查询树。 搜索引擎生成一些计划,从中选择最佳计划。 通过应用一组由实现和转换规则组成的规则来生成计划。 实施规则用于获取计划。 转换规则用于确定等效表达式。 查询树的计划需要根据规定的一组规则来查找树中每个表达式的每个表达式的计划。 数据库实现者选择一组规则,以便生成更有希望的计划,而不是生成所有可能的计划。 在本发明的优选实施例中,搜索引擎进行多次通过以确定最佳方案。 在第一遍中,使用实施规则来生成具有成本的第一计划,该成本用于为附加计划生成时用作阈值。 在每个后续的过程中,使用一组实现和转换规则来生成成本不超过阈值的一个或多个计划。 从生成的计划中选择最佳计划作为成本最低的计划。
    • 9. 发明授权
    • System and method for database query optimization
    • 数据库查询优化的系统和方法
    • US5819255A
    • 1998-10-06
    • US773695
    • 1996-12-27
    • Pedro CelisJay VaishnavHansjorg Zeller
    • Pedro CelisJay VaishnavHansjorg Zeller
    • G06F17/30
    • G06F17/30463Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99936
    • A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into physical expressions and in some cases, execution plans that implement the database query. Each expression has associated with it a set of group attributes that specifies its characteristic inputs and outputs and a cost that estimates the computational expense for executing the expression. The group attributes are used to categorize similar expressions into groups that are stored in a search data structure. They are also used to track duplicate expressions. The cost associated with an expression is used to guide the search process to consider those expressions that will produce low cost plans. The cost is estimated in accordance with a six-fold criteria with each criterion weighted to account for the context of the expression and the application's particular computing environment. The query optimizer is rule-based including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. A OnceGuidance guidance method is used to select a set of rules in certain cases that prevent the regeneration of an existing expression.
    • 本文公开了一种用于优化具有改进的性能增强的数据库查询的系统和方法。 数据库查询由一个或多个逻辑表达式组成。 通过重复应用一个或多个规则,逻辑表达式被转换为物理表达式,在某些情况下,实现数据库查询的执行计划。 每个表达式与它相关联一组指定其特征输入和输出的组属性以及估计执行表达式的计算费用的成本。 组属性用于将类似表达式分组到存储在搜索数据结构中的组。 它们也用于跟踪重复表达式。 与表达式相关联的成本用于指导搜索过程来考虑将生成低成本计划的表达式。 成本按照六标准进行估算,每个标准的加权是为了说明表达式和应用程序的特定计算环境的上下文。 查询优化器是基于规则的,包括用于对子问题中的逻辑表达式执行转换以生成计划的转换和实现规则。 在一些阻止再现现有表达式的情况下,使用OnceGuidance指导方法来选择一组规则。
    • 10. 发明授权
    • System and method for optimizing database queries with improved
performance enhancements
    • 用于优化数据库查询并改进性能增强的系统和方法
    • US6021405A
    • 2000-02-01
    • US763407
    • 1996-12-11
    • Pedro CelisDiana ShakJay VaishnavHansjorg Zeller
    • Pedro CelisDiana ShakJay VaishnavHansjorg Zeller
    • G06F17/30
    • G06F17/30463Y10S707/99932
    • A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into execution plans. The query optimizer partitions the database query into one or more subproblems with each subproblem consisting of one or more logical expressions. A plan is obtained for each subproblem with the plan for the database query including the plans for each subproblem. The query optimizer is cost-based and uses rules including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. The rules are classified into context-free and context-sensitive in order to avoid generating duplicate expressions. Context-free rules are applied once for each logical expression and context-sensitive rules are applied once for each logical expression for a particular optimization goal. In a preferred embodiment, the query optimizer performs several optimization passes over the database query in order to obtain an optimal plan. For each pass, if no optimal plan exists for the requested optimization goal, existing plans having the same optimization goal are utilized with each input reoptimized for a more cost effective plan.
    • 本文公开了一种用于优化具有改进的性能增强的数据库查询的系统和方法。 数据库查询由一个或多个逻辑表达式组成。 通过重复应用一个或多个规则,将逻辑表达式转换为执行计划。 查询优化器将数据库查询分成一个或多个子问题,每个子问题由一个或多个逻辑表达式组成。 为每个子问题获得一个包含数据库查询计划的计划,包括每个子问题的计划。 查询优化器是基于成本的,并使用规则,包括转换和实现规则,用于对子问题中的逻辑表达式执行转换,以便生成计划。 规则分为无上下文和上下文相关,以避免生成重复表达式。 对每个逻辑表达式应用一次无上下文的规则,并为特定优化目标的每个逻辑表达式应用上下文相关规则一次。 在优选实施例中,查询优化器对数据库查询执行若干优化遍历,以便获得最佳计划。 对于每个通行证,如果对于所请求的优化目标没有最优计划,则使用具有相同优化目标的现有计划,每个输入被重新优化以获得更具成本效益的计划。