What happens if for a sort that doesn't fit in memory,
we build an array of the data to be returned on disk
and do a tag sort of the keys plus the index into the array?
Or have I missed the whole question?


Regards,


Ann