[SERVER-59327] Refactor 'n' family of accumulators Created: 12/Aug/21 Updated: 06/Dec/22 |
|
| Status: | Open |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Improvement | Priority: | Minor - P4 |
| Reporter: | Raunak Chowdhury (Inactive) | Assignee: | Backlog - Query Execution |
| Resolution: | Unresolved | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Assigned Teams: |
Query Execution
|
| Sprint: | QE 2021-12-13, QE 2022-01-10, QE 2022-01-24, QE 2022-05-16, QE 2022-05-30, QE 2022-06-13, QE 2022-06-27, QE 2022-07-11, QE 2022-07-25, QE 2022-08-08, QE 2022-08-22 |
| Participants: |
| Description |
|
Once they are implemented, there is some work that can be done to refactor the new set of 'n' accumulators, expressions and window functions. Some ideas include:
|
| Comments |
| Comment by Kyle Suarez [ 01/Sep/22 ] |
|
Deprioritizing this due to both SBE Perf and the Per-shard cursor backports. |
| Comment by Kyle Suarez [ 16/Dec/21 ] |
|
This refactor ticket isn't essential to the Exact Top N project, so after discussion in standup, evicting this from the epic and bumping it to next sprint. |