Choosing a set of group-bys for overlapped computation

• Heuristics

  • The group-bys tree is traversed in a breadth first fashion
    • Group-bys to the left have smaller partition sizes (ergo they require less memory)
      • partition size=(size of group-by ABCD) / (size of group-by ABC)
    • Group-bys at a higher level tend to be bigger

Previous slide

Next slide

Back to first slide

View graphic version