作者: Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
DOI:
关键词:
摘要: A method and apparatus for reordering complex SQL queries containing joins, outer full joins. The first translates the query into a hypergraph representation. Required sets, conflict sets preserved are then generated hypergraph. Using required plurality of plans enumerated, wherein represent associative re-orderings relations in query. operators selectively assigned to each enumerated using and/or so that results from identical original novel Modified General Outer Join (MGOJ) operator may be root sub-tree, MGOJ is compensation operator. assignment performed recursively sub-tree plan. One (generally most optimal) selected execution.