[Join Optimization] Enumerate INLJ for all possible edges between LHS and RHS

XMLWordPrintableJSON

    • Type: Improvement
    • Resolution: Duplicate
    • Priority: Major - P3
    • None
    • Affects Version/s: None
    • Component/s: None
    • None
    • Query Optimization
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      We currently only enumerate INLJ for the first join edge between the LHS and RHS. If we have a graph like A-B-C and A-C (predicates like A.a = C.a and B.b = C.b), and we are considering INLJ(AB, Probe(C)), there are actually two plans to enumerate, one using C.a and one using C.b. We should enumerate both of them.

            Assignee:
            Unassigned
            Reporter:
            Ben Shteinfeld
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

              Created:
              Updated:
              Resolved: