From: | Alexander Kuzmenkov <a(dot)kuzmenkov(at)postgrespro(dot)ru> |
---|---|
To: | David Rowley <david(dot)rowley(at)2ndquadrant(dot)com> |
Cc: | PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
Subject: | Re: Generating partitioning tuple conversion maps faster |
Date: | 2018-07-06 13:08:21 |
Message-ID: | b855199b-bf11-987b-8d4d-e492ae04359c@postgrespro.ru |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 07/05/2018 02:52 PM, David Rowley wrote:
> On 30 June 2018 at 05:40, David Rowley <david(dot)rowley(at)2ndquadrant(dot)com> wrote:
>> I think your idea
>> to reduce the loops in test 6 from 2000 down to 1001 should be worth
>> it. I'll try the idea out next week.
> The attached changes things to use your way of picking up the search
> for the next column at the column after the last match was found.
Great. I think we can use the same approach for
make_inh_translation_list, as in the attached patch. It show some
improvement on test 6. I got the following tps, median of 11 runs
(forgot to turn off fsync though):
test master v3 v4
1 414 416 408
2 259 409 404
3 263 400 405
4 417 416 404
5 118 311 305
6 85 280 303
--
Alexander Kuzmenkov
Postgres Professional: http://www.postgrespro.com
The Russian Postgres Company
Attachment | Content-Type | Size |
---|---|---|
v4-0001-Improve-performance-of-tuple-conversion-map-generati.patch | text/x-patch | 6.7 KB |
From | Date | Subject | |
---|---|---|---|
Next Message | Amit Kapila | 2018-07-06 13:44:00 | Re: Explain buffers wrong counter with parallel plans |
Previous Message | Ashutosh Bapat | 2018-07-06 13:01:08 | Re: [HACKERS] PoC: full merge join on comparison clause |