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
We can have a struct like PlanBase, which is included in all optimizer plan nodes. Then, we can have sorted inside, along with the sort keys (e.g. struct PlanBase { sorted: Vec<usize> }), and add code to infer the property across plan nodes.
The text was updated successfully, but these errors were encountered:
I think we can start with #645 first, and make range filter scan more powerful and useful later with sorted property induction. 🤪 We can postpone this issue a little bit.
In the new planner, this can be implemented as an analysis. The associated data could be Vec<(key: Id, asc_or_desc: bool)>. After this is done, we could have sort-merge-join and sort-group-agg.
We can have a struct like
PlanBase
, which is included in all optimizer plan nodes. Then, we can havesorted
inside, along with the sort keys (e.g.struct PlanBase { sorted: Vec<usize> }
), and add code to infer the property across plan nodes.The text was updated successfully, but these errors were encountered: