hide
Free keywords:
-
Abstract:
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.
