You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Introduce new optimization for filter re-ordering filters that are after a multiple branched cartesian product. The optimization should create a dual-branched cartesian product, followed by the filter as a child of the original cartesian product.
for example the query MATCH (a), (b), (c) WHERE a.x>b.x RETURN a, b, c
a b c
| | |
\ | /
CP
|
filter (a.x > b.x)
will be optimized by
a b
| |
\ /
CP
|
filter (a.x > b.x) c
| |
\ /
CP
The text was updated successfully, but these errors were encountered:
Introduce new optimization for filter re-ordering filters that are after a multiple branched cartesian product. The optimization should create a dual-branched cartesian product, followed by the filter as a child of the original cartesian product.
for example the query
MATCH (a), (b), (c) WHERE a.x>b.x RETURN a, b, c
will be optimized by
The text was updated successfully, but these errors were encountered: