> > Rows are moved. This is done this way to avoid duplicated record > > fetches (when sort results are retrieved) causing random I/O. Sorting > > itself may be also highly I/O bound, but it always operates quite large > blocks. > > Internal sort (quicksort, btw) does not move records, only pointers. > Records are re-ordered in sort order before full run is written to disk (if > necessary).
If each run is sorted on disk, why does FB CPU usage spike when the sort is finishing? I realize that there is a "merge" operation but I would have thought this would be IO intensive more than CPU. Sean ------------------------------------------------------------------------------ "Accelerate Dev Cycles with Automated Cross-Browser Testing - For FREE Instantly run your Selenium tests across 300+ browser/OS combos. Get unparalleled scalability from the best Selenium testing platform available. Simple to use. Nothing to install. Get started now for free." http://p.sf.net/sfu/SauceLabs Firebird-Devel mailing list, web interface at https://lists.sourceforge.net/lists/listinfo/firebird-devel
