-
Notifications
You must be signed in to change notification settings - Fork 4k
Description
The repartition operator should read batches from its input partitions and then map that data to its output partitions using a specific partitioning scheme.
The simplest and most efficient partition schema would be a "round robin batch partitioner". For each input batch, it would pick the next output partition to write to. This is a convenient way to change the number of partitions up or down with minimal overhead.
Another example of a partitioning scheme would be a hash partitioner, which computes the hash of the partition keys on each incoming row and then applies a modulus to determine which output partition to write to.
Reporter: Andy Grove / @andygrove
Assignee: Andy Grove / @andygrove
PRs and other links:
Note: This issue was originally created as ARROW-10582. Please see the migration documentation for further details.