Use more efficient algorithm for block hashagg with many partitions

XMLWordPrintableJSON

    • Type: Improvement
    • Resolution: Fixed
    • Priority: Major - P3
    • 8.0.0-rc0
    • Affects Version/s: None
    • Component/s: None
    • None
    • Query Execution
    • Fully Compatible
    • 5
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      When the block hashagg stage are given many partitions, we use a quadratic algorithm to process the block input. We can check for a large number of partitions and use a better algorithm instead.

            Assignee:
            Matt Boros
            Reporter:
            Matt Boros
            Votes:
            0 Vote for this issue
            Watchers:
            3 Start watching this issue

              Created:
              Updated:
              Resolved: