Implement number of documents tie breaking heuristics

XMLWordPrintableJSON

    • Fully Compatible
    • v7.0, v6.0, v5.0
    • QO 2023-08-07, QO 2023-08-21, QO 2023-09-04
    • 161
    • None
    • 3
    • None
    • None
    • None
    • None
    • None
    • None

      In case if several candidate plans achieved the same highest score, prefer a plan which fetches a smaller number of documents.

      Implementation details:
      In pickBestPlan function, right after we sort candidate plans:
      1. Identified the tied plans
      2. Compare the tied plans by number of examined documents
      3. Increase score for the plan with fewer examined documents by epsilon value (which is defined above as a constant equals to 1e-4)
      4. re-sort the plans

            Assignee:
            Katie Yang (Inactive)
            Reporter:
            Alexander Ignatyev
            Votes:
            0 Vote for this issue
            Watchers:
            8 Start watching this issue

              Created:
              Updated:
              Resolved: