会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 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.
    • 本文公开了一种用于优化具有改进的性能增强的数据库查询的系统和方法。 数据库查询由一个或多个逻辑表达式组成。 通过重复应用一个或多个规则,将逻辑表达式转换为执行计划。 查询优化器将数据库查询分成一个或多个子问题,每个子问题由一个或多个逻辑表达式组成。 为每个子问题获得一个包含数据库查询计划的计划,包括每个子问题的计划。 查询优化器是基于成本的,并使用规则,包括转换和实现规则,用于对子问题中的逻辑表达式执行转换,以便生成计划。 规则分为无上下文和上下文相关,以避免生成重复表达式。 对每个逻辑表达式应用一次无上下文的规则,并为特定优化目标的每个逻辑表达式应用上下文相关规则一次。 在优选实施例中,查询优化器对数据库查询执行若干优化遍历,以便获得最佳计划。 对于每个通行证,如果对于所请求的优化目标没有最优计划,则使用具有相同优化目标的现有计划,每个输入被重新优化以获得更具成本效益的计划。
    • 2. 发明授权
    • 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指导方法来选择一组规则。
    • 3. 发明授权
    • 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查询表示为由许多嵌套表达式组成的查询树。 搜索引擎生成一些计划,从中选择最佳计划。 通过应用一组由实现和转换规则组成的规则来生成计划。 实施规则用于获取计划。 转换规则用于确定等效表达式。 查询树的计划需要根据规定的一组规则来查找树中每个表达式的每个表达式的计划。 数据库实现者选择一组规则,以便生成更有希望的计划,而不是生成所有可能的计划。 在本发明的优选实施例中,搜索引擎进行多次通过以确定最佳方案。 在第一遍中,使用实施规则来生成具有成本的第一计划,该成本用于为附加计划生成时用作阈值。 在每个后续的过程中,使用一组实现和转换规则来生成成本不超过阈值的一个或多个计划。 从生成的计划中选择最佳计划作为成本最低的计划。
    • 5. 发明授权
    • Relational database system and method with high availability compliation
of SQL programs
    • 关系型数据库系统与SQL程序高可用性并发方法
    • US5717911A
    • 1998-02-10
    • US377287
    • 1995-01-23
    • Louise M. MadridRichard A. MeierFranco PutzoluSunil SharmaThomas J. O'SheaJames H. TroisiHansjorg ZellerGary M. GilbertDonald S. MaierElizabeth G. DavisPedro Celis
    • Louise M. MadridRichard A. MeierFranco PutzoluSunil SharmaThomas J. O'SheaJames H. TroisiHansjorg ZellerGary M. GilbertDonald S. MaierElizabeth G. DavisPedro Celis
    • G06F12/00G06F17/30
    • G06F17/30433Y10S707/99932Y10S707/99942
    • An SQL program executor and an SOL compiler both include options for avoiding recompilations of execution plans whenever the runtime object and the compile time object referenced by an execution plan meet predefined schema similarity criteria. Thus, recompilation is sometimes avoided even though the compile time object has been altered or the run time object is not the same object as the compile time object. To enable late binding, schema information is stored in each execution plan for each object to be accessed by the execution plan. The stored schema information is a subset of the full object schema, and includes information about all the aspects of the objects to be accessed which must remain unchanged in order for the execution plan to be operable. While executing a compiled program, the SQL executor avoids recompilations of execution plans whenever the runtime object and the compile time object referenced by an execution plan meet predefined schema similarity criteria. When a recompilation of an SQL program is required, only the execution plans which do not meet the schema similarity criteria are recompiled if the compiled program has been assigned appropriate runtime parameters. The late binding features of the SQL executor also enable a compiled program to access objects distinct from the objects referenced by the program at compile time. Similarly, the SQL compiler includes the ability to recompile only those execution plans which do not meet the schema similarity criteria and thus are inoperable.
    • SQL程序执行器和SOL编译器都包括用于在运行时对象和执行计划引用的编译时对象满足预定义的模式相似性标准时避免重新编译执行计划的选项。 因此,即使编译时间对象已被更改或运行时间对象与编译时间对象不是相同的对象,有时也可避免重新编译。 为了启用后期绑定,模式信息存储在执行计划要访问的每个对象的每个执行计划中。 存储的模式信息是完整对象模式的一个子集,并且包括关于要访问的对象的所有方面的信息,这些信息必须保持不变,以便执行计划可操作。 在执行编译程序时,只要执行计划引用的运行时对象和编译时对象都符合预定义的模式相似性标准,SQL执行程序就会避免重新编译执行计划。 当需要重新编译SQL程序时,如果已编译的程序已分配适当的运行时参数,则仅重新编译不符合模式相似性标准的执行计划。 SQL执行程序的后期绑定功能还使得编译的程序能够在编译时访问与程序引用的对象不同的对象。 类似地,SQL编译器包括仅重新编译那些不符合模式相似性标准因而无法操作的执行计划的能力。
    • 8. 发明授权
    • System and method for optimizing queries
    • 用于优化查询的系统和方法
    • US08554760B2
    • 2013-10-08
    • US12574911
    • 2009-10-07
    • Suresh SubbiahLars FredriksenMurali Mallela KrishnaHansjorg Zeller
    • Suresh SubbiahLars FredriksenMurali Mallela KrishnaHansjorg Zeller
    • G06F17/30
    • G06F17/30463
    • There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first query configured to generate a result set. The query may comprise an operation for an outer table, a first predicate, and a second predicate. The second predicate may comprise a subquery correlated to the operation. Additionally, the first predicate and the second predicate may be disjunctive. The exemplary method also comprises generating a first query tree representing the first query, and generating a second query tree representing a second query. The second query may be configured to generate the result set, and may not comprise the subquery. The exemplary method additionally comprises generating a query plan based on the second query tree.
    • 提供了一种优化查询的计算机实现的方法。 一种示例性方法包括接收配置成生成结果集的第一查询。 该查询可以包括外部表,第一谓词和第二谓词的操作。 第二谓词可以包括与该操作相关的子查询。 另外,第一谓词和第二谓词可能是分离的。 该示例性方法还包括生成表示第一查询的第一查询树,以及生成表示第二查询的第二查询树。 可以将第二查询配置为生成结果集,并且可以不包括子查询。 该示例性方法还包括基于第二查询树生成查询计划。
    • 10. 发明授权
    • System and method for performing database operations on a continuous stream of tuples
    • 在连续的元组流中执行数据库操作的系统和方法
    • US06339772B1
    • 2002-01-15
    • US09347997
    • 1999-07-06
    • Johannes KleinRobbert C. Van der LindenRaj K. RatheeHansjorg Zeller
    • Johannes KleinRobbert C. Van der LindenRaj K. RatheeHansjorg Zeller
    • G06F1730
    • G06F17/30492G06F17/30516Y10S707/99933Y10S707/99934Y10S707/99935
    • The SQL compiler and SQL executor in a database management system are extended to process queries requiring streaming mode processing of data stored in a table. A scan operator performs table access functions during execution of the streaming mode query. The scan operator first performs an initial scan to access rows in a specified database table, and then performs a delta scan to access new rows added to the table, as well as rows modified by other queries. The scan operator continues to process new data added to the table until the initiating user or application closes the associated cursor. A set of data structures are provided to keep track of active scan operators, including a session control block that includes fields for keeping track of whether the scan operator is performing an initial scan or a delta scan. The session control block also includes, for streaming mode scan operators, a delta scan list of new and modified rows to be processed in the delta scan. When a transaction terminates, any streaming mode scan operators whose operation was suspended because of rows locked by the transaction are automatically rescheduled for execution.
    • 数据库管理系统中的SQL编译器和SQL执行器被扩展到处理需要对存储在表中的数据进行流模式处理的查询。 扫描运算符在执行流模式查询期间执行表访问功能。 扫描操作员首先执行初始扫描以访问指定数据库表中的行,然后执行增量扫描以访问添加到表中的新行以及其他查询修改的行。 扫描运算符继续处理添加到表中的新数据,直到启动用户或应用程序关闭相关联的光标。 提供了一组数据结构来跟踪主动扫描运算符,包括会话控制块,其包括用于跟踪扫描运算符是执行初始扫描还是增量扫描的字段。 对于流模式扫描运算符,会话控制块还包括在delta扫描中要处理的新行和修改行的增量扫描列表。 当事务终止时,由于事务锁定行被暂停运行的任何流模式扫描运算符都将自动重新计划执行。