This wikipedia article on external sorting may help :
http://en.wikipedia.org/wiki/External_sorting
On Mon, Dec 21, 2009 at 8:18 PM, Abhilash L L wrote:
> A merge sort would be helpful i guess... it can also happen in parallel
> and IIRC databases use them internally.
>
> Please correct me if i
A merge sort would be helpful i guess... it can also happen in parallel and
IIRC databases use them internally.
Please correct me if im wrong.
Regards,
Abhilash
On Mon, Dec 21, 2009 at 7:06 PM, dinesh bansal wrote:
> On Mon, Dec 21, 2009 at 6:47 PM, Linus Probert wrote:
>
>> If the numbers a
could you describe what kind of data exists . i mean are duplicates allowed?
On Mon, Dec 21, 2009 at 6:47 PM, Linus Probert wrote:
> If the numbers are unique you could use a bitmap-sort this way you could
> easily read just parts of the file at a time.
>
> If they aren't unique it gets a bit tri
On Mon, Dec 21, 2009 at 6:47 PM, Linus Probert wrote:
> If the numbers are unique you could use a bitmap-sort this way you could
> easily read just parts of the file at a time.
>
> If they aren't unique it gets a bit trickier.
>
> /L
>
> dinesh bansal wrote:
> > Hi All,
> >
> > Suppose I have a bi
If the numbers are unique you could use a bitmap-sort this way you could
easily read just parts of the file at a time.
If they aren't unique it gets a bit trickier.
/L
dinesh bansal wrote:
> Hi All,
>
> Suppose I have a big file (~100M) containing integer data. I want to sort
> this file. The p
Hi All,
Suppose I have a big file (~100M) containing integer data. I want to sort
this file. The problem is I don't want to load the complete file data into
main memory in one shot. I mean I can read the file in batches and sort the
batch and save it in another file but cannot store the entire fil
