Query plan reformulation
AssigneeBusiness Objects Software Ltd.
InventorsEric Simon, Francois Llirbat, Francoise Fabret, Nicolas Dieu, Adrian Dragusanu
Life of this patent
Estimating the term…
Abstract
Apparatus, systems, and methods may operate to receive an original query plan, to transform the original query plan into an equivalent executable compact query plan, and to store the compact query plan on a machine readable device. Further activities may include computing maximal source sub-queries associated with the compact query plan, and computing semi-join reductions of the maximal source sub-queries to provide an executable derivative query plan, which may also be stored on a machine readable device. Additional apparatus, systems, and methods are disclosed.
Claims16
An apparatus, comprising:
- a processing node, implemented by one or more processors, comprising a data reception module to receive an original query plan comprising query nodes that include one or more database operations;
- and
- an analysis module, implemented by the one or more processors, to couple to the processing node, the analysis module to;
- transform the original query plan into an equivalent executable compact query plan to store on a machine readable device;
- compute maximal source sub-queries associated with the compact query plan;
- and
- compute semi-join reductions of the maximal source sub-queries associated with the compact query plan to generate a derivative query plan,
- wherein the compact query plan comprises at least two source nodes including scan operations to source tables, the at least two source nodes coupled to at least one abstract node and at least one singleton node, wherein a child of the at least one abstract node comprises at least one of the source nodes or the at least one singleton node, but not another abstract node.
A system, comprising:
- a storage node to store at least one of a plurality of databases;
- a first processing node, implemented by one or more processors, comprising a data reception module to receive at least a portion of an original query plan comprising query nodes that include one or more database operations to be conducted on the plurality of databases;
- and
- a second processing node, implemented by the one or more processors, comprising an analysis module to couple to the first processing node, the analysis module to:
- transform the original query plan into an equivalent executable compact query plan to store on a machine readable device;
- compute maximal source sub-queries associated with the compact query plan;
- and
- compute semi-join reductions of the maximal source sub-queries associated with the compact query plan to generate a derivative query plan,
- wherein the compact query plan comprises at least two source nodes including scan operations to source tables, the at least two source nodes coupled to at least one abstract node and at least one singleton node, wherein a child of the at least one abstract node comprises at least one of the source nodes or the at least one singleton node, but not another abstract node.
A processor-implemented method to execute on one or more processors that perform the method, comprising;
- receiving an original query plan comprising query nodes that include one or more database operations;
- transforming the original query plan into an equivalent executable compact query plan;
- storing the compact query plan on a machine readable device;
- computing maximal source sub-queries associated with the compact query plan;
- and
- computing, using one or more processors, semi-join reductions of the maximal source sub-queries associated with the compact query plan to generate a derivative query plan,
- wherein the compact query plan comprises at least two source nodes including scan operations to source tables, the at least two source nodes coupled to at least one abstract node and at least one singleton node, wherein a child of the at least one abstract node comprises at east one of the source nodes or the at least one singleton node, but not another abstract node.
An article comprising a tangible computer-readable storage medium comprising executable instructions stored thereon which, when executed, result in a processor performing operations comprising:
- receiving an original query plan comprising query nodes that include one or more database operations:
- transforming the original query plan into an equivalent executable compact query plan;
- storing the compact query plan on a machine readable device:
- computing maximal source sub-queries associated with the compact query plan;
- and
- computing semi-join reductions of the maximal source sub-queries associated with the compact query plan to generate a derivative query plan,
- wherein the compact query plan comprises at least two source nodes including scan operations to source tables, the at least two source nodes coupled to at least one abstract node and at least one singleton node, wherein a child of the at least one abstract node comprises at least one of the source nodes or the at least one singleton node, but not another abstract node.
Dependencies are inferred from the claim text.