|Subject||Re: [Firebird-Architect] Re: Some benchmarks about 'Order by' - temporary indexes?...|
> I saw the fact that the indices help.This is impossible. I guess you have
scan(table) + sort(records)
scan(table) + sort(keys) + build_index + walk(part_of_index) +
just because of second query worked with data cached by
> (After further investigations I saw that the gain is bigger if the tableThis is known weak of our sorting algoritm. In-memory we do move
> is wider).
of pointers but on disk we move whole records. You can learn sort.cpp
to be sure
> So, perhaps, if you'll sortAnd this is a way to improve our sorting algoritm
> only the keys (not the entire records) the things will be faster.