Schema must be equivalent / castable. Partition expression must either match or be semantically equivalent. I forgot to implement the same for sort order.
Ideally, we can do the same we did for partition expression for sorting. But to keep it simple for the 1st version, I suggest we require the sort order to match 100%. Eventually we work on a more flexible solution.
Schema must be equivalent / castable. Partition expression must either match or be semantically equivalent. I forgot to implement the same for sort order.
Ideally, we can do the same we did for partition expression for sorting. But to keep it simple for the 1st version, I suggest we require the sort order to match 100%. Eventually we work on a more flexible solution.