| 46 | } |
| 47 | |
| 48 | std::shared_ptr<NodeExpression> getIntersectNode(const QueryGraph& queryGraph, |
| 49 | const std::vector<SubqueryGraph>& buildSubgraphs) { |
| 50 | auto candidates = buildSubgraphs[0].getNbrNodeIndices(); |
| 51 | for (auto i = 1u; i < buildSubgraphs.size(); ++i) { |
| 52 | candidates = intersect(candidates, buildSubgraphs[i].getNbrNodeIndices()); |
| 53 | } |
| 54 | if (candidates.size() != 1) { |
| 55 | throw BinderException("Cannot resolve join condition for multi-way join."); |
| 56 | } |
| 57 | return queryGraph.getQueryNode(candidates[0]); |
| 58 | } |
| 59 | |
| 60 | JoinTreeConstructor::IntermediateResult JoinTreeConstructor::constructTreeNode( |
| 61 | std::shared_ptr<BoundJoinHintNode> hintNode) { |
no test coverage detected