I think version 3.x should do sorting and grouping on disk. Using temporary tables? Once we have btrees, why not using them? It may not be the fastest way of doing it, but it saves lots of memory. Perhaps it could begin doing it in memory and when reaching some certain value it could use the external method.
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
