| From: | Peter Geoghegan <pg(at)bowt(dot)ie> |
|---|---|
| To: | John Naylor <johncnaylorls(at)gmail(dot)com> |
| Cc: | PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: branch-free tuplesort partitioning |
| Date: | 2024-11-25 15:20:30 |
| Message-ID: | CAH2-Wz=8fUc75SzvYxZmv45EHQsoz5k_Y49ciqd8v0m26x5LCg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Mon, Nov 25, 2024 at 7:14 AM John Naylor <johncnaylorls(at)gmail(dot)com> wrote:
> To evaluate this technique further, it'll need some work to handle
> duplicates well.
I suggest using a test program for this that Tom wrote nearly 20 years
ago to validate changes that were made to the Bentley & McIlroy qsort,
available from here:
https://www.postgresql.org/message-id/18732.1142967137@sss.pgh.pa.us
It generates most of the standardized inputs described by the B&M
paper. For example, it will generate "Sawtooth" inputs. (Though I
don't see "organ pipe" input -- that one was a more adversarial case,
described by their paper, which might also be interesting.)
--
Peter Geoghegan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Karina Litskevich | 2024-11-25 15:25:46 | Re: Use more CppAsString2() in pg_amcheck.c |
| Previous Message | Nazir Bilal Yavuz | 2024-11-25 13:36:10 | Re: meson and check-tests |