Currently, Dask partitioning implementation is very incomplete. It mostly relies on Dask's own partitioning logic, and it only supports even partitioning when there is no partition keys, and the approach is not scalable either. So we need to implement all partitioning algos: "hash", "rand" and "even" for cases with or without partition keys.
Currently, Dask partitioning implementation is very incomplete. It mostly relies on Dask's own partitioning logic, and it only supports even partitioning when there is no partition keys, and the approach is not scalable either. So we need to implement all partitioning algos: "hash", "rand" and "even" for cases with or without partition keys.