公开(公告)号：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.

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

公开(公告)号：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枚举之前，可以从查询计划中删除所有外部连接（无论是左侧还是右侧）以及所有异常连接（无论是左侧还是右侧）。

公开(公告)号：US20070112827A1

公开(公告)日：2007-05-17

申请号：US11272583

申请日：2005-11-10

申请人： Richard Dettinger ,  John Dietel ,  Daniel Kolz ,  Jeffrey Tenner

发明人： Richard Dettinger ,  John Dietel ,  Daniel Kolz ,  Jeffrey Tenner

IPC分类号： G06F7/00

CPC分类号： G06F16/2465

摘要： A method, system and article of manufacture for processing rule sets and, more particularly, for processing abstract rule sets having one or more abstract rules. One embodiment provides a computer-implemented method of generating recommendations using a suitable rules engine. The method comprises retrieving an abstract rule having a conditional statement and a consequential statement. The consequential statement defines a particular recommendation that is returned when the conditional statement is satisfied. The conditional statement and the consequential statement are defined using logical field definitions defined in an abstraction model that models underlying physical data in a manner making a schema of the physical data transparent to a user of the abstraction model. The method further comprises transforming the abstract rule into a transformed rule; and executing, by the rules engine, the transformed rule. If the conditional statement is resolved to true for the executed transformed rule, the particular recommendation is returned.

摘要翻译： 一种用于处理规则集的方法，系统和制品，更具体地说，涉及用于处理具有一个或多个抽象规则的抽象规则集。 一个实施例提供了使用合适的规则引擎生成建议的计算机实现的方法。 该方法包括检索具有条件语句和后续语句的抽象规则。 后续语句定义了满足条件语句时返回的特定建议。 条件语句和后果语句使用在抽象模型中定义的逻辑字段定义来定义，该抽象模型以使得物理数据的模式对抽象模型的用户透明的方式对底层物理数据进行建模。 该方法还包括将抽象规则转换为变换规则; 并且由规则引擎执行变换的规则。 如果条件语句对于已执行的转换规则解析为true，则返回特定的建议。

公开(公告)号：US20060195437A1

公开(公告)日：2006-08-31

申请号：US11068264

申请日：2005-02-28

申请人： John Dietel

发明人： John Dietel

IPC分类号： G06F17/30

CPC分类号： G06F17/30457 ,  Y10S707/99933 ,  Y10S707/99934

摘要： Methods, apparatuses, and computer program products for materialized query table matching are provided that include receiving a database query, retrieving a materialized query table (MQT) from data storage accessible to a database management system, selecting a join in the materialized query table between a table that is not invoked by the query and a table that is invoked in the query, determining whether the selected join is lossless, and expanding the query to include the lossless join if the selected join is lossless, expanding the query to include the lossless join. Determining whether the selected join is lossless may be carried out by losslessly joining the table that is not invoked by the query to the query, and determining whether the lossless join to the query matches the selected join of the materialized query table.

摘要翻译： 提供了用于物化查询表匹配的方法，装置和计算机程序产品，包括接收数据库查询，从数据库管理系统可访问的数据存储中检索物化查询表（MQT），在物理化查询表中选择一个连接 查询中未调用的表和查询中调用的表，确定所选连接是否为无损，并且如果所选连接无损，则扩展查询以包括无损连接，将查询扩展为包含无损连接 。 确定所选择的连接是否是无损的，可以通过将查询未被调用的表无损地加入查询来执行，并且确定对查询的无损连接是否与所述实体化查询表的所选连接相匹配。