Optimal shuffling of window operators to reduce Sort and Partition operators

[sreemanamala]

Description

This commit aims to shuffle the window operators optimally to reduce sort and partition operators. for example:

partition by k1 order by k2, k3
partition by k2 order by k1, k3
partition by k1, k2 order by k3

can be shuffled to

partition by k1 order by k2, k3
partition by k1, k2 order by k3
partition by k2 order by k1, k3

to reduce a sort operator

---

Key changed/added classes in this PR

• Windowing

---

This PR has:

• [x] been self-reviewed.
  • [ ] using the concurrency checklist (Remove this item if the PR doesn't have any relation to concurrency.)
• [ ] added documentation for new or modified features or behaviors.
• [ ] a release note entry in the PR description.
• [ ] added Javadocs for most classes and all non-trivial methods. Linked related entities via Javadoc links.
• [ ] added or updated version, license, or notice information in licenses.yaml
• [ ] added comments explaining the "why" and the intent of the code wherever would not be obvious for an unfamiliar reader.
• [x] added unit tests or modified existing tests to cover new code paths, ensuring the threshold for code coverage is met.
• [ ] added integration tests.
• [ ] been tested in a test Druid cluster.

[kgyrtkirk]

I see some related test failures and could you add a test to document the expectations from the comparator?

[github-actions[bot]]

This pull request has been marked as stale due to 60 days of inactivity. It will be closed in 4 weeks if no further activity occurs. If you think that's incorrect or this pull request should instead be reviewed, please simply write any comment. Even if closed, you can still revive the PR at any time or discuss it on the [email protected] list. Thank you for your contributions.

[github-actions[bot]]

This pull request/issue has been closed due to lack of activity. If you think that is incorrect, or the pull request requires review, you can revive the PR at any time.