TY - GEN
T1 - Faster join enumeration for complex queries
AU - Moerkotte, Guido
AU - Neumann, Thomas
PY - 2008
Y1 - 2008
N2 - Most existing join ordering algorithms concentrate on join queries with simple join predicates and inner joins only, where simple predicates are those that involve exactly two relations. However, real queries may contain complex join predicates, i.e. predicates involving more than two relations. We show how to handle complex join predicates efficiently, by modeling the query graph as a hypergraph and reasoning about its connected subgraphs.
AB - Most existing join ordering algorithms concentrate on join queries with simple join predicates and inner joins only, where simple predicates are those that involve exactly two relations. However, real queries may contain complex join predicates, i.e. predicates involving more than two relations. We show how to handle complex join predicates efficiently, by modeling the query graph as a hypergraph and reasoning about its connected subgraphs.
UR - http://www.scopus.com/inward/record.url?scp=52649170230&partnerID=8YFLogxK
U2 - 10.1109/ICDE.2008.4497579
DO - 10.1109/ICDE.2008.4497579
M3 - Conference contribution
AN - SCOPUS:52649170230
SN - 9781424418374
T3 - Proceedings - International Conference on Data Engineering
SP - 1430
EP - 1432
BT - Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
T2 - 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
Y2 - 7 April 2008 through 12 April 2008
ER -