Reduce complexity of groupby-aggregate code
Open
- Dominant language
- Python
- Stars
- 89
- Forks
- 26
- PR merge metrics
- No merged PRs in 30d
Description
The code we reuse from `dask/dask` to implement groupby-aggregate is quite complex. At least some of that complexity seems unnecessary (https://github.com/dask/dask/pull/10840/files#r1459340037), so we should revisit the code and try to remove some complexity.
Contributor guide
Research direction
Start by reading the groupby-aggregate implementation reused from dask/dask and the linked discussion in dask/dask pull request 10840. Identify which complexity is unnecessary, then verify that the revised implementation preserves the existing groupby-aggregate behavior; the issue does not name specific files or tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data-engineering
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100