发明授权
- 专利标题: Fast algorithms for computing semijoin reduction sequences
- 专利标题(中): 用于计算半干扰减少序列的快速算法
-
申请号: US11494065申请日: 2006-07-27
-
公开(公告)号: US08271478B2公开(公告)日: 2012-09-18
- 发明人: Gerhard L. Hill , Thomas Peh
- 申请人: Gerhard L. Hill , Thomas Peh
- 申请人地址: DE Walldorf
- 专利权人: SAP AG
- 当前专利权人: SAP AG
- 当前专利权人地址: DE Walldorf
- 代理机构: Mintz, Levin, Cohn, Ferris, Glovsky and Popeo, P.C.
- 主分类号: G06F7/00
- IPC分类号: G06F7/00 ; G06F17/30
摘要:
Systems and methods for using optimization techniques to construct a nearly optimal execution plan for an outer join query are disclosed. A query graph of the outer join query is constructed, by computing for each node the set of nodes influencing it, for each target node the set of its needed reducers, and predetermining the effects of all admissible moves in all possible sequences. The directed graph of all admissible move sequences is formed. An optimization process includes dynamically generating good estimations for the target distance of a search state. Some heuristics are disclosed for providing start solutions for the optimization process.
公开/授权文献
信息查询