Re: An implementation of multi-key sort

From: Heikki Linnakangas <hlinnaka(at)iki(dot)fi>
To: Wang Yao <yaowangm(at)outlook(dot)com>, PostgreSQL Hackers <pgsql-hackers(at)postgresql(dot)org>
Cc: "interma(at)outlook(dot)com" <interma(at)outlook(dot)com>
Subject: Re: An implementation of multi-key sort
Date: 2024-05-22 15:29:34
Message-ID: f8653c5a-4b1c-4c97-886e-db2a45993cc3@iki.fi
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 22/05/2024 15:48, Wang Yao wrote:
> Comparing to classic quick sort, it can get significant performance
> improvement once multiple keys are available. A rough test shows it got
> ~129% improvement than qsort for ORDER BY on 6 keys, and ~52% for CREATE
> INDEX on the same data set. (See more details in section "Performance
> Test")

Impressive. Did you test the performance of the cases where MK-sort
doesn't help, to check if there is a performance regression?

--
Heikki Linnakangas
Neon (https://neon.tech)

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Ranier Vilela 2024-05-22 16:09:50 Re: Avoid possible dereference null pointer (src/backend/catalog/pg_depend.c)
Previous Message Euler Taveira 2024-05-22 15:16:24 Re: speed up a logical replica setup