发明申请
US20050160102A1 Look-ahead predicate generation for join costing and optimization
审中-公开
前瞻性谓词生成用于连接成本核算和优化
- 专利标题: Look-ahead predicate generation for join costing and optimization
- 专利标题(中): 前瞻性谓词生成用于连接成本核算和优化
-
申请号: US10758485申请日: 2004-01-15
-
公开(公告)号: US20050160102A1公开(公告)日: 2005-07-21
- 发明人: Abdo Abdo , Robert Bestgen , John Dietel
- 申请人: Abdo Abdo , Robert Bestgen , John Dietel
- 申请人地址: US NY ARMONK
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY ARMONK
- 主分类号: G06F7/00
- IPC分类号: G06F7/00 ; G06F17/30
摘要:
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.
信息查询