Re: Sorted partition ranges without overlap

You can implement your own partitioner based on your own logic. Yong From: Kristoffer Sjögren <sto...@gmail.com> Sent: Monday, March 13, 2017 9:34 AM To: user Subject: Sorted partition ranges without overlap Hi I have a RDD<byte[]> that needs

Sorted partition ranges without overlap

Hi I have a RDD that needs to be sorted lexicographically and then processed by partition. The partitions should be split in to ranged blocks where sorted order is maintained and each partition containing sequential, non-overlapping keys. Given keys (1,2,3,4,5,6) 1. Correct - 2