×

Load balancing for complex database query plans

  • US 7,849,073 B2
  • Filed: 12/18/2006
  • Issued: 12/07/2010
  • Est. Priority Date: 12/18/2006
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method for parallelizing a database query plan, comprising:

  • positioning, by a computer, a data flow exchange operator in a database query tree, wherein the exchange operator comprises a plurality of buffers, and wherein the exchange operator is configured to receive inputs from a plurality of parallel operators;

    parallelizing, by the computer, a first child operator of the exchange operator into a plurality of parallel second child operators, each of the parallel second child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree;

    wherein each branch of the parallel branches is configured to be processed by a respective processor thread;

    wherein each of the plurality of second child operators has a first input, and wherein the parallelizing comprises;

    partitioning an input of the first child operator into a plurality of first inputs; and

    replacing the first child operator with the plurality of second child operators, each of the plurality of second child operators being positioned in a respective branch of the plurality of parallel branches and coupled to one of said plurality of first inputs; and

    buffering, at the exchange operator, in respective ones of the plurality of buffers, an output of each of the plurality of parallel second child operators.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×