Simplify $lookup compilation in SBE

XMLWordPrintableJSON

    • Type: Improvement
    • Resolution: Unresolved
    • Priority: Major - P3
    • None
    • Affects Version/s: None
    • Component/s: None
    • None
    • Query Execution
    • QE 2025-08-04, QE 2025-08-18, QE 2025-09-01, QE 2025-09-15, QE 2025-09-29
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      • $lookup is currently translated into an enormous tree involving coscan, limit, unions, unwind etc
      • This project is to simplify the translation
      • It is expected that this will result in a performance improvement as well
      • This project should make it easy to optimize the case where we are joining on non-array fields (or want to ignore the set-intersection as join predicate)
      • All subsequent $lookup projects on this roadmap will benefit from this work
      • It is expected that this project will also benefit $lookup-$unwind. If that is not feasible, it should become the responsibility of SPM-4344 to ensure that similar improvements apply to the $LU case.

            Assignee:
            Alberto Massari
            Reporter:
            Rushan Chen
            Votes:
            0 Vote for this issue
            Watchers:
            3 Start watching this issue

              Created:
              Updated: