to do this.
Thanks all for your time and suggestions.
Regards,
Subramanian. K
On Thursday, 30 November 2017 19:53:01 UTC+5:30, Slawomir Pryczek wrote:
>
> It should be very simple if you have additional 2G of memory. You divide
> the data to X parts where X is power of 2 and X needs to be
Hi
I am using native sort provided part of the package and to process 48MB of
slice data, it takes ~45sec.
To run 2GB of data it takes really long time, I am trying to split these to
buckets and make it run concurrently, finally need to collate results of
all these small sorted buckets.
Do we
