RE: GSOC 2018 Project - A New Sorting Routine
От | Kefan Yang |
---|---|
Тема | RE: GSOC 2018 Project - A New Sorting Routine |
Дата | |
Msg-id | 5b5f8149.1c69fb81.e06c6.d054@mx.google.com обсуждение исходный текст |
Ответ на | Re: GSOC 2018 Project - A New Sorting Routine (Tomas Vondra <tomas.vondra@2ndquadrant.com>) |
Список | pgsql-hackers |
Hey Tomas!
Sorry to bother but it would be great if we can get the test results this week.
Regards,
Kefan
From: Tomas Vondra
Sent: July 24, 2018 8:16 AM
To: Kefan Yang
Cc: Andrey Borodin; Peter Geoghegan; alvherre@2ndquadrant.com; PostgreSQL Hackers
Subject: Re: GSOC 2018 Project - A New Sorting Routine
On 07/24/2018 12:21 AM, Kefan Yang wrote:
> Hi Tomas!
>
> I did a few tests on my own Linux machine, but the problem is that my
> resources on AWS(CPU, RAM and even Disk space) are very limited. I
> considered establishing virtual machine on my own PC but the performance
> is even worse.
>
> My original patch has two main optimizations: (1) switch to heap sort
> when depth limit exceeded (2) check whether the array is presorted only
> once at the beginning. Now I want to test these optimizations
> separately. On AWS EC2 instance, regressions on CREATE INDEX cases seems
> to be less significant if we use (1) only, but I can only test up to
> 100000 records and 512MB memory using your scripts.
>
> So would you mind re-running the tests using the two patches I provided
> in the attachment? That will be very helpful
>
I can do that, but it'll have to wait a couple of days. I'm currently
using the boxes for some other tests.
regards
--
Tomas Vondra http://www.2ndQuadrant.com
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services
В списке pgsql-hackers по дате отправления: