Quote:
Originally Posted by kovidgoyal
You should be able to reduce the sort overhead by using a virtual library, though off hand I can't recall if the current database code restricts to the VL when sorting or not, I know the new db code does.
|
It does a search of all records to build the VL, then sorts the results of that search. One would need to see the VL search expression to know which of those two operations is the slower one.