公开(公告)号：US20050086208A1

公开(公告)日：2005-04-21

申请号：US10687286

申请日：2003-10-16

申请人： Robert Bestgen ,  John Dietel ,  Robert Downer

发明人： Robert Bestgen ,  John Dietel ,  Robert Downer

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

CPC分类号： G06F17/30463 ,  G06F17/30466 ,  Y10S707/99932

摘要： An apparatus, program product and method utilize a query optimizer that identifies Join types in a query plan that can be replaced to facilitate optimization of the plan. If the query plan is considered to have a tree-graph representation, then the optimizer locates Join nodes to be replaced and substitutes an Inner Join node and additional nodes that do not inhibit optimization strategies and algorithms. As a result, all Outer Joins, whether left or right, and all Exception Joins, whether left or right, can be removed from the query plan before performing optimizations such as predicate movement, GROUP BY movement, ORDER BY movement, and Join enumeration.

摘要翻译： 设备，程序产品和方法利用查询优化器来识别可以替换的查询计划中的连接类型，以促进计划的优化。 如果查询计划被认为具有树形图表示，那么优化器定位要替换的连接节点，并替代内部连接节点和不抑制优化策略和算法的其他节点。 因此，在进行优化，如谓词移动，GROUP BY移动，ORDER BY运动和Join枚举之前，可以从查询计划中删除所有外部连接（无论是左侧还是右侧）以及所有异常连接（无论是左侧还是右侧）。

公开(公告)号：US20060224561A1

公开(公告)日：2006-10-05

申请号：US11094655

申请日：2005-03-30

申请人： Robert Bestgen ,  Carol Ramler ,  Jeffrey Tenner

发明人： Robert Bestgen ,  Carol Ramler ,  Jeffrey Tenner

IPC分类号： G06F17/30

CPC分类号： G06F17/30457 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99943

摘要： A query facility for database queries saves and re-uses query execution strategies, and automatically determines whether a strategy can be re-used when an imported variable changes. The query facility automatically saves one or more logical conditions associated with the one or more imported variables in the query. When the query is reused, the logical conditions are evaluated using the imported variable values, and the previously saved execution strategy is used only if the condition or conditions are met. Preferably, the logical conditions express a range of imported variable values which are included in a database subset data structure used by the saved query execution strategy, such as a materialized query table or partitioned table. Logical conditions are preferably generated by negating the predicates from a logical expression defining the applicability of the execution strategy, inserting the negated predicates into the query, and performing a transitive closure.

摘要翻译： 数据库查询的查询功能可以保存并重新使用查询执行策略，并自动确定在导入的变量更改时是否可以重新使用策略。 查询设备自动保存与查询中的一个或多个导入的变量相关联的一个或多个逻辑条件。 当重新使用查询时，使用导入的变量值来评估逻辑条件，并且仅当满足条件或条件时才使用先前保存的执行策略。 优选地，逻辑条件表示包括在由保存的查询执行策略（例如物化查询表或分区表）使用的数据库子集数据结构中的导入变量值的范围。 逻辑条件优选地通过从定义执行策略的适用性，将否定的谓词插入到查询中并且执行传递闭包的逻辑表达式来取消谓词来产生。

公开(公告)号：US20050160102A1

公开(公告)日：2005-07-21

申请号：US10758485

申请日：2004-01-15

申请人： Abdo Abdo ,  Robert Bestgen ,  John Dietel

发明人： Abdo Abdo ,  Robert Bestgen ,  John Dietel

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

CPC分类号： G06F16/2456

摘要： A relational database system analyzes each potential join in a query, to determine whether a relation involved in the join is subject to a selection criterion, and evaluate whether that selection criterion or the join per se effects a join reduction. The computational expense of generating a look-ahead predicate comprising the tuples of the second relation matching any applicable selection criterion, is compared to the computational savings that result from the join reduction. The most beneficial look-ahead predicate among all potential joins of relations in the query is identified through iterative analysis of all possible joins. Thereafter, membership in the look-ahead predicate is added as a selection criterion on the first relation, and further iterative analysis is performed of all possible joins of the remaining relations and the look-ahead predicate, to iteratively identify additional joins in the query that benefit from the formation of the look-ahead predicate, and potentially form further look-ahead predicates.

摘要翻译： 关系数据库系统分析查询中的每个潜在连接，以确定连接中涉及的关系是否受制于选择标准，并评估该选择标准或连接本身是否影响连接缩减。 将包括与任何适用的选择标准相匹配的第二关系的元组的生成预先谓词的计算费用与由连接减少产生的计算节省进行比较。 通过对所有可能的连接进行迭代分析，可以确定查询中关系中所有潜在联系中最有利的预言谓词。 此后，将先行谓词的成员资格作为关于第一关系的选择标准被添加，并且对剩余关系和先行谓词的所有可能连接执行进一步的迭代分析，以迭代地识别查询中的附加联接 受益于先行谓词的形成，并可能形成进一步的预言谓词。

公开(公告)号：US20070073761A1

公开(公告)日：2007-03-29

申请号：US11239617

申请日：2005-09-29

申请人： Mark Anderson ,  Robert Bestgen ,  James Flanagan ,  Scott Forstie ,  Thomas Schreiber

发明人： Mark Anderson ,  Robert Bestgen ,  James Flanagan ,  Scott Forstie ,  Thomas Schreiber

IPC分类号： G06F7/00

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

摘要： Continual generation of index advice that includes generating an index advice for an index of a table in a computer database and recording values of statistical attributes of the index advice accumulated across repeated generations of the index advice. The generating and recording typically are carried out continually without user intervention. Embodiments include recording values of attributes of the index advice that specify an index. Typical embodiments also include, continually and without user intervention, recording values of attributes of the index advice that characterize usefulness of an index and recording values of attributes of the index advice that characterize cost of creating an index.

摘要翻译： 持续生成索引建议，包括为计算机数据库中的表的索引生成索引建议，并记录索引建议的重复次数累积的索引建议的统计属性的值。 生成和记录通常在没有用户干预的情况下持续进行。 实施例包括记录指定索引的索引建议的属性的值。 典型实施例还包括持续地且没有用户干预的记录索引建议的属性的值，其表征索引的有用性，并记录表征创建索引的成本的索引建议的属性的值。

公开(公告)号：US20070239673A1

公开(公告)日：2007-10-11

申请号：US11278714

申请日：2006-04-05

申请人： Eric Barsness ,  Robert Bestgen ,  John Santosuosso

发明人： Eric Barsness ,  Robert Bestgen ,  John Santosuosso

IPC分类号： G06F17/30

CPC分类号： G06F16/24542

摘要： In an embodiment, a query tree is created that represents a query expression, where the query tree includes a union of nodes. Each of the nodes represents a respective partition of a table, and the query expression specifies a key value and the table. A determination is made whether a result set exists that includes the key value, where the result set was previously retrieved from the table. If the determination is true, a decision is made based on the result set whether the key value is stored in the respective partition represented by each of the nodes. The nodes for which the key value is not stored in the respective partition are removed from the query tree to create an optimization tree, and the optimization tree is used to retrieve data from the table. In this way, nodes that are not necessary to be searched may be removed from query trees, in order to increase the performance of the query.

摘要翻译： 在一个实施例中，创建表示查询表达式的查询树，其中查询树包括节点的并集。 每个节点表示表的相应分区，查询表达式指定键值和表。 确定是否存在包含键值的结果集，其中先前从表中检索结果集。 如果确定为真，则基于结果集确定密钥值是否存储在由每个节点表示的相应分区中。 键值不存储在相应分区中的节点从查询树中删除以创建优化树，并且优化树用于从表中检索数据。 以这种方式，可以从查询树中删除不需要搜索的节点，以便增加查询的性能。

公开(公告)号：US20070192372A1

公开(公告)日：2007-08-16

申请号：US11353515

申请日：2006-02-14

申请人： Robert Bestgen ,  James Flanagan ,  Michale Pfeifer

发明人： Robert Bestgen ,  James Flanagan ,  Michale Pfeifer

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  G06F17/30386

摘要： A database management system maintains a record of queries which can be executed against the database. For a given auxiliary database structure, an advisory function automatically reviews the query record and identifies those queries which might execute with greater efficiency using the auxiliary database structure, presenting analytical information to the user. Preferably, the auxiliary database structure is an index, and the information is used for determining whether to include the index in the database definition. Preferably, a query optimizer records potentially useful indexes when considering multiple alternative database optimizations, and this information is later retrieved to identify queries which would benefit from an index.

摘要翻译： 数据库管理系统维护可以针对数据库执行的查询记录。 对于给定的辅助数据库结构，咨询功能自动审查查询记录，并使用辅助数据库结构识别可能以更高效率执行的查询，向用户呈现分析信息。 优选地，辅助数据库结构是索引，并且该信息用于确定是否将数据包括在数据库定义中。 优选地，当考虑多个备选数据库优化时，查询优化器记录潜在有用的索引，并且稍后检索该信息以识别将从索引中受益的查询。