Vlad Horsun wrote:

>
> This is known weak of our sorting algoritm. In-memory we do move
> of pointers but on disk we move whole records. You can learn sort.cpp
> to be sure

Are you sure that's a weakness? True it makes sorting slower, but
it avoids re-reading the records in sorted order which is much slower.
We should only be carrying the fields that were requested, so the
size of the record doesn't matter, only the number and size of the
fields in the select list.


Regards,


Ann