tree 1b18cfd745f7f84b11145b2512a30b7eaab212e1
parent fd8cd3051cf97798e8945c800ef787c507e74375
author Ali Alsuliman <ali.al.solaiman@gmail.com> 1674812590 -0800
committer Ali Alsuliman <ali.al.solaiman@gmail.com> 1674860080 +0000

[ASTERIXDB-3101][COMP] Optimize pushing assign ops down

- user model changes: no
- storage format changes: no
- interface changes: yes

Details:
One of the things that PushFieldAccessRule attempts to do is
push assign operator down as close as possible to the respective
data scan operator. The assign operator is pushed recursively
through the operators below it one by one until the data scan is
reached. This becomes expensive when there is a large number
of assigns. In the case where all the operators below the assign
operator are other assign operators, the assign operator
could be moved directly above the data-scan skipping all
the intermediate assign operators.

- add default method to IAlgebraicRewriteRule to allow the rules
  to know if they are about to rewrite a nested plan root.

Optimize ExtractCommonExpressionsRule since the current traversal
of operators becomes expensive with a large number of operators.
- optimize ExtractCommonExpressionsRule to work on only roots of
  plans since the implementation descends to children recursively.
  check if the operator was already rewritten after descending to
  the children to allow post order traversal from the root.

Change-Id: I035b72089f973bb08dccf5f9305f8b06da7fc458
Reviewed-on: https://asterix-gerrit.ics.uci.edu/c/asterixdb/+/17316
Integration-Tests: Jenkins <jenkins@fulliautomatix.ics.uci.edu>
Tested-by: Jenkins <jenkins@fulliautomatix.ics.uci.edu>
Reviewed-by: Michael Blow <mblow@apache.org>