by myself,
but I'd like to get a report exactly the same as yours. It's really
helpful.
Thanks in advance.
Yao Wang
On Mon, Jun 10, 2024 at 5:09 AM Tomas Vondra
wrote:
>
> Hello Yao,
>
> I was interested in the patch, considering the promise of significant
> speedup
quot; is about an implementation
of multi-key heap and should be treated as a separated task. We need
to clarify the naming to avoid confusion.
I updated code which is related to only function/var renaming and
relevant comments, plus some minor assertions changes. Please see the
attachment.
Than
ch
better than the old approach (-1198.1%).
Thanks,
Yao Wang
On Fri, May 24, 2024 at 8:50 PM Yao Wang wrote:
>
> When all leading keys are different, mksort will finish the entire sort at the
> first sort key and never touch other keys. For the case, mksort falls back to
> kind of qsort ac
ext;
explain analyze select c1 from t2 order by c6, c5, c4, c3, c2, c1;
Results:
MKsort:
12374.427 ms
12528.068 ms
12554.718 ms
qsort:
12251.422 ms
12279.938 ms
12280.254 ms
MKsort is a bit slower than qsort, which can be explained by extra
checks of MKsort.
Yao Wang
On Fri, May 24, 2024 at 8:3
